Efficient algorithms for dualizing large-scale hypergraphs
نویسندگان
چکیده
منابع مشابه
Efficient algorithms for dualizing large-scale hypergraphs
A hypergraph F is a set family defined on vertex set V . The dual of F is the set of minimal subsetsH of V such that F∩H 6= ∅ for any F ∈ F . The computation of the dual is equivalent to many problems, such as minimal hitting set enumeration of a subset family, minimal set cover enumeration, and the enumeration of hypergraph transversals. Although many algorithms have been proposed for solving ...
متن کاملEfficient Algorithms for Large-Scale Temporal Aggregation
The ability to model time-varying natures is essential to many database applications such as data warehousing and mining. However, the temporal aspects provide many unique characteristics and challenges for query processing and optimization. Among the challenges is computing temporal aggregates, which is complicated by having to compute temporal grouping. In this paper, we introduce a variety o...
متن کاملEfficient Algorithms for Large-Scale Image Analysis
The past decade has seen major improvements in the capabilities and availability of imaging sensor systems. Commercial satellites routinely provide panchromatic images with sub-meter resolution. Airborne line scanner cameras yield multi-spectral data with a ground sample distance of 5 cm. The resulting overabundance of data brings with it the challenge of timely analysis. Fully automated proces...
متن کاملEfficient Algorithms in Large-Scale Agent Systems
........................................................................................................................... i CHAPTER
متن کاملDualizing Scene Reconstruction Algorithms
It has been known since the work of Carlsson [2] and Weinshall [17] that there is a dualization principle that allows one to interchange the role of points being viewed by several cameras and the camera centres themselves. In principle this implies the possibility of dualizing projective reconstruction algorithms to obtain new algorithms. In this paper, this theme is developed at a theoretical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.01.012